Some single-machine and flowshop scheduling problems with a non-linear deterioration function
نویسندگان
چکیده
منابع مشابه
Some Single - Machine Scheduling Problems with a Mixed Learning Function
Recently, the topic of scheduling with learning effects has kept growing attention, and a survey is further provided to classify the learning models in scheduling into two types, namely position-based learning and sum-ofprocessingtimes-based learning. However, the actual processing time of a given job fast drops to zero as the number of jobs increases in the first model and when the normal job ...
متن کاملTwo-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration
This paper considers two scheduling problems for a two-machine flowshop where a single machine is followed by a batching machine. The first problem is that there is a transporter to carry the jobs between machines. The second problem is that there are deteriorating jobs to be processed on the single machine. For the first problem with minimizing the makespan, we formulate it as a mixed integer ...
متن کاملSingle-machine group scheduling problems with deterioration consideration
In many realistic situations, a job processed later consumes more time than the same job when it is processed earlier; this phenomenon is known as deteriorating jobs. However, job deterioration is relatively unexplored in the context of group technology. In this paper, we consider deterioration in the framework ofminimizing themakespan and the total completion time in single-machine group sched...
متن کاملFlowshop scheduling problems with transportation or deterioration between the batching and single machines
0360-8352/$ see front matter 2008 Elsevier Ltd. A doi:10.1016/j.cie.2008.07.022 * Corresponding author. Tel./fax: +86 24 83680169 E-mail addresses: [email protected] (L. Tang In this paper, we consider two new types of the two-machine flowshop scheduling problems where a batching machine is followed by a single machine. The first type is that normal jobs with transportation between machin...
متن کاملSingle machine scheduling problems with delivery times under simple linear deterioration
We consider several single machine scheduling problems in which the processing time of a job is a simple linear increasing function of its starting time and each job has a delivery time. The objectives are to minimize the functions about delivery completion times. For the former three problems, we propose polynomial-time algorithms to solve them. For the last problem, we prove that it is NP-har...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2011
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2011.07.037